upcScavenger » Classes Of Prime Numbers » Wiki: Pierpont Prime

Pierpont prime

( Classes Of Prime Numbers )

Distribution
Primality testing
Pierpont primes found as..
Polygon construction
Generalization
See also
References

C O N T E N T S

Cdot Pierpont Prime Primes

Rank: 100%

Wiki
Comments
Media

In number theory, a Pierpont prime is a prime number of the form $2^u\cdot 3^v + 1\,$ for some nonnegative and . That is, they are the prime numbers for which is Smooth number. They are named after the mathematician James Pierpont, who used them to characterize the that can be constructed using . The same characterization applies to polygons that can be constructed using ruler, compass, and angle trisection, or using paper folding.

Except for 2 and the , every Pierpont prime must be 1 modulo 6. The first few Pierpont primes are:

It has been conjectured that there are infinitely many Pierpont primes, but this remains unproven.

Distribution

A Pierpont prime with is of the form

2^u+1

, and is therefore a Fermat prime (unless ). If is Positive number then must also be positive (because

3^v+1

would be an even number greater than 2 and therefore not prime), and therefore the non-Fermat Pierpont primes all have the form , when is a positive integer (except for 2, when ).

Empirically, the Pierpont primes do not seem to be particularly rare or sparsely distributed; there are 42 Pierpont primes less than 10⁶, 65 less than 10⁹, 157 less than 10²⁰, and 795 less than 10¹⁰⁰. There are few restrictions from algebraic factorisations on the Pierpont primes, so there are no requirements like the Mersenne prime condition that the exponent must be prime. Thus, it is expected that among -digit numbers of the correct form $2^u\cdot3^v+1$ , the fraction of these that are prime should be proportional to , a similar proportion as the proportion of prime numbers among all -digit numbers. As there are $\Theta(n^{2})$ numbers of the correct form in this range, there should be $\Theta(n)$ Pierpont primes.

Andrew M. Gleason made this reasoning explicit, conjecture there are infinitely many Pierpont primes, and more specifically that there should be approximately Pierpont primes up to .. Footnote 8, p. 191. According to Gleason's conjecture there are $\Theta(\log N)$ Pierpont primes smaller than N, as opposed to the smaller conjectural number $O(\log \log N)$ of Mersenne primes in that range.

Primality testing

When

2^u > 3^v

2^u\cdot 3^v + 1

is a Proth number and thus its primality can be tested by Proth's theorem. On the other hand, when

2^u < 3^v

alternative primality tests for

M=2^u\cdot 3^v + 1

are possible based on the factorization of

M-1

as a small even number multiplied by a large power of 3..

Pierpont primes found as factors of Fermat numbers

As part of the ongoing worldwide search for factors of , some Pierpont primes have been announced as factors. The following tableWilfrid Keller, Fermat factoring status. gives values of m, k, and n such that

The left-hand side is a Fermat number; the right-hand side is a Pierpont prime.

+ ! m !! k!! n !! Year !! Discoverer

Cullen, Cunningham & Western

Robinson

Keller

Harvey Dubner

Taura

Young

Cosgrave & Gallot

Nohara, Jobling, George Woltman & Gallot

Keiser, Jobling, Penné & Fougeron

Cooper, Jobling, Woltman & Gallot

Cosgrave, Jobling, Woltman & Gallot

Brown, Reynolds, Penné & Fougeron

Greer, Reynolds, Penné & Fougeron

, the largest known Pierpont prime is 81 × 2^20498148 + 1 (6,170,560 decimal digits), whose primality was discovered in June 2023.;

Polygon construction

In the mathematics of paper folding, the Huzita axioms define six of the seven types of fold possible. It has been shown that these folds are sufficient to allow the construction of the points that solve any cubic equation.. It follows that they allow any regular polygon of sides to be formed, as long as and is of the form , where is a product of distinct Pierpont primes. This is the same class of regular polygons as those that can be constructed with a compass, straightedge, and Angle trisection. Regular polygons which can be constructed with only compass and straightedge (constructible polygons) are the special case where and is a product of distinct , themselves a subset of Pierpont primes.

In 1895, James Pierpont studied the same class of regular polygons; his work is what gives the name to the Pierpont primes. Pierpont generalized compass and straightedge constructions in a different way, by adding the ability to draw whose coefficients come from previously constructed points. As he showed, the regular -gons that can be constructed with these operations are the ones such that the totient of is 3-smooth. Since the totient of a prime is formed by subtracting one from it, the primes for which Pierpont's construction works are exactly the Pierpont primes. However, Pierpont did not describe the form of the composite numbers with 3-smooth totients.. As Gleason later showed, these numbers are exactly the ones of the form given above.

The smallest prime that is not a Pierpont (or Fermat) prime is 11; therefore, the hendecagon is the first regular polygon that cannot be constructed with compass, straightedge and angle trisector (or origami, or conic sections). All other regular with can be constructed with compass, straightedge and trisector.

Generalization

A Pierpont prime of the second kind is a prime number of the form 2^u3^v − 1. These numbers are

The largest known primes of this type are ; currently the largest known is $2^{136279841}-1$ (41,024,320 decimal digits). The largest known Pierpont prime of the second kind that is not a Mersenne prime is $3\cdot 2^{22103376}-1$ , found by PrimeGrid. 3*2^22103376 - 1 (6,653,780 Decimal Digits), from The Prime Pages.

A generalized Pierpont prime is a prime of the form $p_1^{n_1} \!\cdot p_2^{n_2} \!\cdot p_3^{n_3} \!\cdot \ldots \cdot p_k^{n_k} + 1$ with k fixed primes p₁ < p₂ < p₃ < ... < p_k. A generalized Pierpont prime of the second kind is a prime of the form $p_1^{n_1} \!\cdot p_2^{n_2} \!\cdot p_3^{n_3} \!\cdot \ldots \cdot p_k^{n_k} - 1$ with k fixed primes p₁ < p₂ < p₃ < ... < p_k. Since all primes greater than 2 are odd, in both kinds p₁ must be 2. The sequences of such primes in the OEIS are:

{ p₁, p₂, p₃, ..., p_k}	+ 1	− 1
{2}
{2, 3}
{2, 5}
{2, 3, 5}
{2, 7}
{2, 3, 5, 7}
{2, 11}
{2, 13}

Pierpont prime

( Classes Of Prime Numbers )

Account

Navigation

Statistics

Pierpont prime ( Classes Of Prime Numbers )

Account

Navigation

Statistics

Pierpont prime

( Classes Of Prime Numbers )